Generating Diagnoses for Probabilistic Model Checking Using Causality
نویسندگان
چکیده
One of the major advantages of model checking over other formal methods of verification is its ability to generate an error trace when the specification is falsified in the model. We call this trace a counterexample. In probabilistic model checking (PMC), counterexample generation has a quantitative aspect. The counterexample is a set of paths in which a path formula holds, and their accumulated probability mass violates the probability bound. In this paper, we address the complementary task of counterexample generation, which is the counterexample diagnosis. We propose an aided-diagnostic method for probabilistic counterexamples based on the notion of causality. Given a counterexample for a probabilistic CTL (PCTL) formula that does not hold over Discrete Time Markov Chain (DTMC) model, this method guides the user to the most responsible causes in the counterexample.
منابع مشابه
On the Synergy of Probabilistic Causality Computation and Causality Checking
In recent work on the safety analysis of systems we have shown how causal relationships amongst events can be algorithmically inferred from probabilistic counterexamples and subsequently be mapped to fault trees. The resulting fault trees were significantly smaller and hence easier to understand than the corresponding probabilistic counterexample, but still contain all information needed to dis...
متن کاملDiagnosis of Probabilistic Models using Causality and Regression
The counterexample in probabilistic model checking (PMC) is a set of paths in which a path formula holds, and their accumulated probability violates the probability bound. However, understanding the counterexample is not an easy task. In this paper we address the complementary task of counterexample generation, which is the counterexample analysis. We propose an aided-diagnostic method for prob...
متن کاملCausality Checking of Safety-Critical Software and Systems
The complexity of modern safety-critical systems is steadily increasing due to the amount of functionality that is implemented in those systems. In order to be able to asses the correctness and safety of these systems in a comprehensive manner automated or, at least, computer-aided techniques are needed. Model checking, a formal verification technique, provides an automated algorithmic analysis...
متن کاملDebugging of Markov Decision Processes (MDPs) Models
In model checking, a counterexample is considered as a valuable tool for debugging. In Probabilistic Model Checking (PMC), counterexample generation has a quantitative aspect. The counterexample in PMC is a set of paths in which a path formula holds, and their accumulative probability mass violates the probability threshold. However, understanding the counterexample is not an easy task. In this...
متن کاملA short introduction to two approaches in formal verification of security protocols: model checking and theorem proving
In this paper, we shortly review two formal approaches in verification of security protocols; model checking and theorem proving. Model checking is based on studying the behavior of protocols via generating all different behaviors of a protocol and checking whether the desired goals are satisfied in all instances or not. We investigate Scyther operational semantics as n example of this...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- CIT
دوره 21 شماره
صفحات -
تاریخ انتشار 2013